Two Approximative Algorithms for Calculating Minimum-Length Polygons in 3D Space
نویسندگان
چکیده
We consider simple cube-curves in the orthogonal 3D grid. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded set. The curve’s length is defined to be that of the minimum-length polygonal curve (MLP) fully contained and complete in the tube of the curve. So far no provable general algorithm is known for the approximative calculation of such an MLP. This paper presents two approximative algorithms for computing the MLP of a general simple cube-curve in O(n) time, where n is the total number of critical edges of the given simple cube-curve.
منابع مشابه
An Approximative Calculation of Relative Convex Hulls for Surface Area Estimation of 3D Digital Objects
Relative convex hulls have been suggested for multigridconvergent surface area estimation. Besides the existence of a convergence theorem there is no efficient algorithmic solution so far for calculating 3D relative convex hulls. This article discusses an approximative solution based on minimum-length polygon calculations. It is illustrated that this approximative calculation also proves (exper...
متن کاملMinimum-Length Polygons of First-Class Simple Cube-Curves
We consider simple cube-curves in the orthogonal 3D grid. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded set. The curve’s length is defined to be that of the minimum-length polygonal curve (MLP) fully contained and complete in the tube of the curve. So far only one general algorithm called rubber-band algorithm was known for the a...
متن کاملA New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity
Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...
متن کاملA Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کاملLower bounds for approximate polygon decomposition and minimum gap
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, into rectangles, and show an Ω(n log n) lower bound on the timecomplexity. The result holds for any decomposition, optimal or approximative. The bound matches the complexity of a number of algorithms in the literature, pr...
متن کامل